Private Information Retrieval: A Primer
نویسنده
چکیده
Private Information Retrieval (PIR) protocols allow a client to retrieve a data item from a database while hiding the identity of the item being retrieved. In information-theoretic k-server PIR protocols the database is replicated among k servers, and each server learns absolutely nothing about the item the client retrieves. In computational PIR protocols the database is stored on one server, and a computationallybounded server learns nothing about the item the client retrieves. The important challenge in this area is to design protocols in which the communication complexity of retrieving one out of n bits of data is sub-linear. This primer discusses the PIR problem, surveys the known results on PIR, describes the basic construction of information-theoretic and computational PIR protocols, and presents applications of PIR protocols. The primer is intended for readers that do not necessary have background in cryptography. In particular, we supply the background from cryptography, combinatorics, and number theory that is needed to understand the results.
منابع مشابه
Private Key based query on encrypted data
Nowadays, users of information systems have inclination to use a central server to decrease data transferring and maintenance costs. Since such a system is not so trustworthy, users' data usually upkeeps encrypted. However, encryption is not a nostrum for security problems and cannot guarantee the data security. In other words, there are some techniques that can endanger security of encrypted d...
متن کاملRelational-Complete Private Information Retrieval
We show how relational algebra queries can be processed over relational databases encoded for private information retrieval. In particular, we illustrate how each of the constructs for relational algebra can be compiled into an online stream of private information retrieval requests. This brings relational-complete query capabilities to traditional private information retrieval schemes, which g...
متن کاملReplication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval
We establish the following, quite unexpected, result: replication of data for the computational Private Information Retrieval problem is not necessary. More speciically, based on the quadratic resid-uosity assumption, we present a single database, computationally-private information-retrieval scheme with O(n) communication complexity for any > 0.
متن کاملA T-private K-database Private Information Retrieval Scheme
A private information retrieval scheme enables a user to privately recover an item from a public accessible database. In this paper we present a private information retrieval scheme for k repli-cated databases. The scheme is information-theoretically secure against coalitions of databases of size t k ? 1. It improves the communication complexity of the scheme described in 12] for coalitions of ...
متن کاملOn the Possibility of Basing Oblivious Transfer on Weakened Private Information Retrieval
We consider the problem of reducing Oblivious Transfer to Private Information Retrieval. We give a simple reduction from 1-out-of-2 Oblivious Transfer to Private Information Retrieval, where the reduction is against malicious players. We also consider the completeness of Private Information Retrieval on weakened assumption. We will give a impossibility result and a possibility result. For impos...
متن کامل